The Remaining Service Time upon Reaching a High Level in M/G/1 Queues

نویسندگان

  • Pieter-Tjerk de Boer
  • Victor F. Nicola
  • Jan-Kees C. W. van Ommeren
چکیده

The distribution of the remaining service time upon reaching some target level in an M/G/1 queue is of theoretical as well as practical interest. In general, this distribution depends on the initial level as well as on the target level, say, B. Two initial levels are of particular interest, namely, level “1” (i.e., upon arrival to an empty system) and level “B − 1” (i.e., upon departure at the target level). In this paper, we consider a busy cycle and show that the remaining service time distribution, upon reaching a high level B due to an arrival, converges to a limiting distribution for B → ∞. We determine this asymptotic distribution upon the “first hit” (i.e., starting with an arrival to an empty system) and upon “subsequent hits” (i.e., starting with a departure at the target) into a high target level B. The form of the limiting (asymptotic) distribution of the remaining service time depends on whether the system is stable or not. The asymptotic analysis in this paper also enables us to obtain good analytical approximations of interesting quantities associated with rare events, such as overflow probabilities.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on the remaining service time upon reaching a target level in the M/G/1 queue

In this note we establish connections between new and previous results on the remaining service time upon reaching a target level in the M/G/1 queue.

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Bernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters

In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Sugarcane transportation process modeling by time series approach

Sugarcane is one of the severely perishable crops that is used as raw material for white sugar production. Sucrose content of the sugarcane which is of high commercial value decreases in quality due to pre-harvest burning, high ambient temperature, kill-to-mill delays as well as microbial contaminations. Delays in sugarcane transportation are the most important risks which can affect the qualit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Queueing Syst.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2001